Ja n 20 06 New upper bound for a class of vertex Folkman numbers
نویسنده
چکیده
Let a 1 ,. .
منابع مشابه
New Upper Bound for a Class of Vertex Folkman Numbers
Let a1, . . . , ar be positive integers, m = ∑r i=1(ai−1)+1 and p = max{a1, . . . , ar}. For a graph G the symbol G → {a1, . . . , ar} denotes that in every r-coloring of the vertices of G there exists a monochromatic ai-clique of color i for some i = 1, . . . , r. The vertex Folkman numbers F (a1, . . . , ar; m − 1) = min{|V (G)| : G → (a1 . . . ar) and Km−1 6⊆ G} are considered. We prove that...
متن کاملAn almost quadratic bound on vertex Folkman numbers
The vertex Folkman number F (r, n,m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices yields a monochromatic copy of Kn. The problem of bounding the Folkman numbers has been studied by several authors. However, in the most restrictive case, when m = n + 1, no polynomial bound has been known for such numbe...
متن کاملNew Recurrent Inequality on a Class of Vertex Folkman Numbers
Let G be a graph and V (G) be the vertex set of G. Let a1 ,. . . , ar be positive integers, m = ∑ r i=1 (ai−1)+1 and p = max{a1, . . . , ar}. The symbol G → {a1, . . . , ar} denotes that in every r-coloring of V (G) there exists a monochromatic ai-clique of color i for some i = 1, . . . , r. The vertex Folkman numbers F (a1, . . . , ar ; m − 1) = min{|V (G)| : G → (a1 . . . ar) and Km−1 6⊆ G} a...
متن کاملOn Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers
Extending the problem of determining Ramsey numbers Erdős and Rogers introduced the following function. For given integers 2 ≤ s < t let fs,t(n) = min {max{|S| : S ⊆ V (H) and H[S] contains no Ks}} , where the minimum is taken over all Kt-free graphs H of order n. This function attracted a considerable amount of attention but despite that, the gap between the lower and upper bounds is still fai...
متن کاملNew Upper Bound on Vertex Folkman Numbers
In 1970, J. Folkman proved that for a given integer r and a graph G of order n there exists a graph H with the same clique number as G such that every r coloring of vertices of H yields at least one monochromatic copy of G. His proof gives no good bound on the order of graph H, i.e. the order of H is bounded by an iterated power function. A related problem was studied by Luczak, Ruciński and Ur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006